Time Bounded Frequency Computations
نویسندگان
چکیده
This disproves a conjecture of Kinber. (2) We give a transparent proof of a generalization of Kinber's result that there exist arbitrarily complex problems admitting a polynomial time frequency computation. Several corollaries provide more insight into the structure of the hierarchy of polynomial time frequency classes. (3) The relationships between polynomial time frequency classes and selectivity classes are studied. ] 1997 Academic
منابع مشابه
Learning recursive functions from approximations
This article investigates algorithmic learning, in the limit, of correct programs for recursive functions f from both input output examples of f and several interesting varieties of approximate additional (algorithmic) information about f. Specifically considered, as such approximate additional information about f, are Rose's frequency computations for f and several natural generalizations from...
متن کاملRelations Between Diagonalization, Proof Systems, and Complexity Gaps
In this paper we study diagonal processes over time bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal pro& that they operate in the given time bound. This replaces the traditional “clock” jr. .-zsource bounded diagonalization by formal proofs about running times and establishes close relations between properties of proof syst...
متن کاملThe Power of Frequency Computation
The notion of frequency computation concerns approxima-tive computations of n distinct parallel queries to a set A. A is called (m; n)-recursive if there is an algorithm which answers any n distinct parallel queries to A such that at least m answers are correct. This paper gives natural combinatorial characterizations of the fundamental inclusion problem, namely the question for which choices o...
متن کاملConcurrent Zero Knowledge in the Bounded Player Model
In this paper we put forward the Bounded Player Model for secure computation. In this new model, the number of players that will ever be involved in secure computations is bounded, but the number of computations is not a priori bounded. Indeed, while the number of devices and people on this planet can be realistically estimated and bounded, the number of computations these devices will run can ...
متن کاملSpace-Efficient Error Reduction for Unitary Quantum Computations
This paper presents a general space-efficient method for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness c and soundness s, either with or without a witness (corresponding to QMA and BQP, respectively). To convert this computation into a new computation with error at most 2−p, the most space-efficient method known requires extra ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997